Listing closed sets of strongly accessible set systems with applications to data mining
نویسندگان
چکیده
منابع مشابه
Listing closed sets of strongly accessible set systems with applications to data
We study the problem of listing all closed sets of a closure operator σ that is a partial function on the power set of some finite ground set E, i.e., σ : F → F with F ⊆ P(E). A very simple divide-and-conquer algorithm is analyzed that correctly solves this problem if and only if the domain of the closure operator is a strongly accessible set system. Strong accessibility is a strict relaxation ...
متن کاملEfficient Closed Pattern Mining in Strongly Accessible Set Systems
Many problems in data mining can be viewed as a special case of the problem of enumerating the closed elements of an independence system with respect to some specific closure operator. Motivated by real-world applications, e.g., in track mining, we consider a generalization of this problem to strongly accessible set systems and arbitrary closure operators. For this more general problem setting,...
متن کاملListing Maximal Subgraphs in Strongly Accessible Set Systems
Algorithms for listing the subgraphs satisfying a given property (e.g., being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U ,F) uses a ground set U (e.g., the network nodes) and an indicator F ⊆ 2U of which subsets of U have the required property. For the problem of listing all sets in F maximal under inclusion, the ambitious goal is to cover ...
متن کاملSome new properties of fuzzy strongly ${{g}^{*}}$-closed sets and $delta {{g}^{*}}$-closed sets in fuzzy topological spaces
In this paper, a new class of fuzzy sets called fuzzy strongly ${{g}^{*}}$-closed sets is introduced and its properties are investigated. Moreover, we study some more properties of this type of closed spaces.
متن کاملClosed Set Mining of Biological Data
"!# $ " ! &%(' )'* + , -" . 0/1 23 45 768 9-" :45 "!; ' <= > ? $6@ A B $C " C > D ' E )' F @ 9'# $6HG> . ( " I J' $ K L' :4 @GC K 7GC )68 $ 76M KN = O + " . "!"BP%L ;GC . 4 * '" Q ' R A 9 $ ! 0 ' S T . " , /J QG T $ K U ) ; $ V W X Y Z $ ) -> $ 0/[
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.10.024